2-Connecting outerplanar graphs without blowing up the pathwidth
نویسندگان
چکیده
منابع مشابه
2-connecting Outerplanar Graphs without Blowing Up the Pathwidth
Given a connected outerplanar graph G of pathwidth p, we give an algorithm to add edges to G to get a supergraph of G, which is 2-vertex-connected, outerplanar and of pathwidth O(p). This settles an open problem raised by Biedl [1], in the context of computing minimum height planar straight line drawings of outerplanar graphs, with their vertices placed on a two dimensional grid. In conjunction...
متن کاملPathwidth of outerplanar graphs
We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [2], after having proved that the pathwidth of every biconnected outerplanar graph is always at most twice the pathwidth of its (geometric) dual plus two, conjectured that there exists a constant c such that the pathwidth of every biconnected...
متن کاملApproximation the Pathwidth of Outerplanar Graphs
Pathwidth is a well-known NP-Complete graph metric. Only very simple classes of graphs, such as trees, are known to permit practical pathwidth algorithms. We present a technique to approximate the pathwidth of outerplanar graphs. Our algorithm works in linear time, is genuinely practical and produces solutions at most three times the optimum.
متن کاملApproximation of Pathwidth of Outerplanar Graphs
There exists a polynomial time algorithm to compute the pathwidth of outerplanar graphs [3], but the large exponent makes this algorithm impractical. In this paper, we give an algorithm, that given a biconnected outerplanar graph G, finds a path decomposition of G of pathwidth at most at most twice the pathwidth of G plus one. To obtain the result, several relations between the pathwidth of a b...
متن کاملOuterplanar obstructions for matroid pathwidth
For each non-negative integer k, we provide all outerplanar obstructions for the class of graphs whose cycle matroid has pathwidth at most k. Our proof combines a decomposition lemma for proving lower bounds on matroid pathwidth and a relation between matroid pathwidth and linearwidth. Our results imply the existence of a linear algorithm that, given an outerplanar graph, outputs its matroid pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.04.032